Shotgun Assembly of Labeled Graphs
نویسندگان
چکیده
منابع مشابه
Shotgun assembly of labeled graphs
We consider the problem of reconstructing graphs or labeled graphs from neighborhoods of a given radius r. Special instances of this problem include DNA shotgun assembly, neural network reconstruction, and assembling random jigsaw puzzles. We provide some necessary and some sufficient conditions for correct recovery both in combinatorial terms and for some generative models including random lab...
متن کاملShotgun Sequence Assembly
Shotgun sequencing is the most widely used technique for determining the DNA sequence of organisms. It involves breaking up the DNA into many small pieces that can be read by automated sequencing machines, then piecing together the original genome using specialized software programs called assemblers. Due to the large amounts of data being generated and to the complex structure of most organism...
متن کاملenergy of binary labeled graphs
let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$. a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$. in this paper we introduce a new kind of graph energy for the binary labeled graph, the labeled graph energy $e_{l}(g)$. it depends on the underlying graph $g$...
متن کاملShotgun Assembly of Random Jigsaw Puzzles
In a recent work, Mossel and Ross considered the shotgun assembly problem for a random jigsaw puzzle. Their model consists of a puzzle an n×n grid, where each vertex is viewed as a center of a piece. They assume that each of the four edges adjacent to a vertex, is assigned one of q colors (corresponding to ”jigs”, or cut shapes) uniformly at random. Mossel and Ross asked: how large should q = q...
متن کاملShotgun edge assembly of random jigsaw puzzles
In recent work by Mossel and Ross, it was asked how large q has to be for a random jigsaw puzzle with q different shapes of “jigs” to have exactly one solution. The jigs are assumed symmetric in the sense that two jigs of the same type always fit together. They showed that for q = o(n) there are a.a.s. multiple solutions, and for q = ω(n) there is a.a.s. exactly one. The latter bound has since ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Network Science and Engineering
سال: 2019
ISSN: 2327-4697,2334-329X
DOI: 10.1109/tnse.2017.2776913